Recognizing Hamming Graphs in Linear Time and space
نویسندگان
چکیده
Hamming graphs are, by definition, the Cartesian product of complete graphs. In the bipartite case these graphs are hypercubes. We present an algorithm recognizing Hamming graphs in linear time and space. This improves a previous algorithm which was linear in time but not in space. This also favorably compares to the general decomposition algorithms of graphs with respect to the Cartesian product, none of which is linear.
منابع مشابه
On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs
This paper contains a new algorithm that recognizes whether a given graph G is a Hamming graph , i . e . a Cartesian product of complete graphs , in O ( m ) time and O ( n 2 ) space . Here m and n denote the numbers of edges and vertices of G , respectively . Previously this was only possible in O ( m log n ) time . Moreover , we present a survey of other recognition algorithms for Hamming grap...
متن کاملA simple O(mn) algorithm for recognizing Hamming graphs
We show that any isometric irredundant embedding of a graph into a product of complete graphs is the canonical isometric embedding. This result is used to design a simple O(mn) algorithm for recognizing Hamming graphs.
متن کاملRecognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs
In this paper, we consider the recognition problem on three classes of perfect graphs, namely, the HH-free, the HHDfree, and the Welsh-Powell opposition graphs (or WPO-graphs). In particular, we prove properties of the chordal completion of a graph and show that a modified version of the classic linear-time algorithm for testing for a perfect elimination ordering can be efficiently used to dete...
متن کاملRecognizing Median Graphs in Subquadratic Time
Motivated by a dynamic location problem for graphs, Chung, Graham and Saks introduced a graph parameter called windex. Graphs of windex 2 turned out to be, in graph-theoretic language, retracts of hypercubes. These graphs are also known as median graphs and can be characterized as partial binary Hamming graphs satisfying a convexity condition. In this paper an O(n 3 2 logn) algorithm is present...
متن کاملRecognizing HHD-free and Welsh-Powell Opposition Graphs
In this paper, we consider the recognition problem on two classes of perfectly orderable graphs, namely, the HHD-free and the Welsh-Powell opposition graphs (or WPOgraphs). In particular, we prove properties of the chordal completion of a graph and show that a modified version of the classic linear-time algorithm for testing for a perfect elimination ordering can be efficiently used to determin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 63 شماره
صفحات -
تاریخ انتشار 1997